Real-World Extensions to a Production Scheduling Algorithm Based on Lagrangian Relaxation

In this article, we develop three e f lc ient extensions t o a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-world features: 0 stochastic availability of raw material, 0 reworking and scrapping of parts , and 0 incorporating set-up costs and set-up t imes in the Scheduling of multiclass manufacturing sys tems The f irs t t w o extensions yield on-lane algorithms which are illustrated using a 89-job scheduling problem. The t h i d extension uses an algorithmic procedure t o inserl switchovers t o obtain a good schedule and is illustrated for a two-class , 89-job scheduling problem.